A consideration of the social commentary within D.H. Lawrence's novel The rainbow : a thesis presented in partial fulfilment of the requirements for the degree of Master of Arts in English at Massey University

D.H. Lawrence's critical essay "Why The Novel Matters" contains the personal claim: "Nothing is important but life... For this reason I am a novelist... The novel is the book of life." 1 D.H. Lawrence, "Why The Novel Matters" D.H. Lawrence. Selected Literary Criticism (1956), ed. Anthony Beal, Mercury Books, London. 1961. pp. 104, 105. This claim is elaborated upon in "Morality And The Novel": "The business of art is to reveal the relation between man and his circumambient universe at the living moment... If we think about it, we find that our life consists in this achieving of a pure relationship between ourselves and the living universe about us." 2 D.H. Lawrence, "Morality and The Novel" D.H. Lawrence. Selected Literary Criticism pp. 108, 109. Arnold Kettle, writing in An Introduction to the English Novel suggests that The Rainbow contains within it a manifestation of these assertions. He contends: "The search, the passionate, desperate search of the characters of The Rainbow is to achieve personal relationships which make them at one with the universe." 3 Arnold Kettle, An Introduction to the English Novel Volume II (1953) Hutchinson University Library, London. 1965. p. 109. He adds to this contention his conviction that this novel is firmly grounded in reality, that within The Rainbow Lawrence is concerned with "actual human social issues". 4 ibid., p. 111. Some of these issues he then indicates: " ...there is the whole question of the relationship between work and personality; there is an examination of the social set-up of Cossethay and Beldover, the position of the squire and the vicar and the schoolmaster; there is the problem of industrialism, the significance of the canal and the railways and the pits; there is a great deal and from many points of view about the English educational system; there is the question of the impact of the English Midlands on the Polish émigrés; above all there is all that is implied in the phrase 'the emancipation of women'."

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

The maximum common subgraph (MCS) problem has become increasingly important in those aspects of chemoinformatics that involve the matching of 2D or 3D chemical structures. This paper provides a classification and a review of the many MCS algorithms, both exact and approximate, that have been described in the literature, and makes recommendations regarding their applicability to typical chemoinformatics tasks

Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases

This paper reports an evaluation of both graph-based and fingerprint-based measures of structural similarity, when used for virtual screening of sets of 2D molecules drawn from the MDDR and ID Alert databases. The graph-based measures employ a new maximum common edge subgraph isomorphism algorithm, called RASCAL, with several similarity coefficients described previously for quantifying the similarity between pairs of graphs. The effectiveness of these graph-based searches is compared with that resulting from similarity searches using BCI, Daylight and Unity 2D fingerprints. Our results suggest that graph-based approaches provide an effective complement to existing fingerprint-based approaches to virtual screening

IMPLICATIONS OF CHANGING AID PROGRAMS TO U.S. AGRICULTURE

Agricultural Finance,

Radiation effects in spacecraft electronics

Effects on the internal spacecraft electronics due to exposure to the natural and enhanced space radiation environment will be reviewed. The emphasis will be placed on the description of the nature of both the exposure environment and failure mechanisms in semiconductors. Understanding both the system environment and device effects is critical in the use of laboratory simulation environments to obtain the data necessary to design and qualify components for successful application

Low energy spin fluctuations in the heavy fermion compound Ce0.925_{0.925}La0.075_{0.075}Ru2_{2}Si2_{2}

We report inelastic neutron scattering measurements performed on a single crystal of the heavy fermion compound Ce$_{0.925}$La$_{0.075}$Ru$_{2}$Si$_{2}$, which is at the borderline between an antiferromagnetically ordered and a paramagnetic ground state. Intensity maps as a function of wavevector and energy ($0.1<E<1.2$ meV) were obtained at temperatures $T=0.1$ and 2 K, using the time-of-flight spectrometer IRIS. An unexpected saturation of the relaxation rate and static susceptibility of the spin fluctuations is found at low temperatures.Comment: 2 pages, 2 figures, SCES'04 Proceeding

Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures

This paper compares several published methods for clustering chemical structures, using both graph- and fingerprint-based similarity measures. The clusterings from each method were compared to determine the degree of cluster overlap. Each method was also evaluated on how well it grouped structures into clusters possessing a non-trivial substructural commonality. The methods which employ adjustable parameters were tested to determine the stability of each parameter for datasets of varying size and composition. Our experiments suggest that both graph- and fingerprint-based similarity measures can be used effectively for generating chemical clusterings; it is also suggested that the CAST and Yin–Chen methods, suggested recently for the clustering of gene expression patterns, may also prove effective for the clustering of 2D chemical structures

Computation of the intervals of uncertainties about the parameters found for identification

A modeling method to calculate the intervals of uncertainty for parameters found by identification is described. The region of confidence and the general approach to the calculation of these intervals are discussed. The general subprograms for determination of dimensions are described. They provide the organizational charts for the subprograms, the tests carried out and the listings of the different subprograms

RASCAL: calculation of graph similarity using maximum common edge subgraphs

A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the exact degree and composition of similarity. The proposed MCES algorithm is based on a maximum clique formulation of the problem and is a significant improvement over other published algorithms. It presents new approaches to both lower and upper bounding as well as vertex selection